Approximating the Maximum Quadratic Assignment Problem 1 Esther M. Arkin2 Refael Hassin3 Maxim Sviridenko4 Keywords: Approximation algorithm; quadratic assignment problem

Source URL: www.ams.sunysb.edu

DFG-Schwerpunktprogramm 1324 Extraktion quantifizierbarer Information aus komplexen Systemen” ” Local Convergence of the Alternating Least Squares Algorithm For Canonical Tensor Approximation

Source URL: www.dfg-spp1324.de

Implementation of a Component-By-Component Algorithm to Generate Small Low-Discrepancy Samples Benjamin Doerr, Michael Gnewuch, and Magnus Wahlstr¨om Abstract In [B. Doerr, M. Gnewuch, P. Kritzer, F. Pillichshammer. Mo

Source URL: www.numerik.uni-kiel.de

• Quasirandomness
• Diophantine approximation
• Low-discrepancy sequence
• Numerical analysis
• Random number generation
• Randomized rounding
• Randomized algorithm
• Quasi-Monte Carlo method

Barriers to Near-Optimal Equilibria Tim Roughgarden Computer Science Department Stanford University Stanford, CA, USA Email:

Source URL: theory.stanford.edu

• Game theory
• Price of anarchy
• Approximation algorithm
• Mathematical optimization
• Epsilon-equilibrium
• Congestion game
• Optimization problem
• Computational complexity theory
• Nash equilibrium
• Mechanism design

Noname manuscript No. (will be inserted by the editor) Extended Formulations in Mixed Integer Conic Quadratic Programming Juan Pablo Vielma, Iain Dunning, Joey Huchette and Miles

Source URL: web.mit.edu

• Operations research
• Combinatorial optimization
• Approximations
• Mathematical optimization
• Relaxation
• Linear programming relaxation
• Linear programming
• Integer programming
• Approximation algorithm
• Constructible universe

SIAM J. COMPUT. Vol. 43, No. 1, pp. 312–336 c 2014 Society for Industrial and Applied Mathematics 

Source URL: theory.stanford.edu

• Computational complexity theory
• Operations research
• Complexity classes
• Polynomial-time approximation scheme
• Mechanism design
• Optimization problem
• Approximation algorithm
• Time complexity
• Mathematical optimization
• Exact algorithm
• Single-parameter utility
• Perturbation theory

Homework #5 in Design and Analysis of Algorithms Question 1 Let A be a randomized approximation algorithm for a certain counting problem such that given any input I to the problem and an approximation parameter 0 < ǫ <

Source URL: www.eng.tau.ac.il

This paper was presented as part of the main technical program at IEEE INFOCOMWireless Link Scheduling under Physical Interference Model Peng-Jun Wan∗ , Ophir Frieder† , Xiaohua Jia‡ , Frances Yao‡ , Xiaoh

Source URL: www.cs.cityu.edu.hk

• Applied mathematics
• Radio resource management
• Wireless ad-hoc network
• Power control
• Throughput
• Wireless mesh network
• Graph coloring
• Approximation algorithm
• Algorithm
• Theoretical computer science
• Wireless networking
• Mathematics

Large Scale Machine Learning

Source URL: www.sanjivk.com

• Machine learning
• Mathematics
• Approximation algorithms
• Numerical analysis
• Discrete geometry
• Nearest neighbor search
• K-nearest neighbor algorithm
• Supervised learning
• Information science
• Search algorithms
• Artificial intelligence

EnerJ: Approximate Data Types for Safe and General Low-Power Computation Adrian Sampson Werner Dietl Emily Fortuna

Source URL: homes.cs.washington.edu

• Mathematics
• Numerical analysis
• Data types
• Computer arithmetic
• Computational complexity theory
• Floating point
• Algorithm
• Dynamic random-access memory
• Approximation
• Computer memory
• Theoretical computer science
• Computing